β 0 - Excellent Graphs
نویسندگان
چکیده
LetG = (V,E) be a simple graph. Let u ∈ V (G). u is said to be β0 good if u is contained in a β0-set of G. u is said to beβ0-bad if there exists noβ0-set of G containing u. A graph G is said to be β0excellent if every vertex of G is β0-good. In this paper, many results on β0 excellent are obtained. And some relation between some other parameters are also investigated. Mathematics Subject Classification: 05C69
منابع مشابه
Roman domination excellent graphs: trees
A Roman dominating function (RDF) on a graph $G = (V, E)$ is a labeling $f : V rightarrow {0, 1, 2}$ suchthat every vertex with label $0$ has a neighbor with label $2$. The weight of $f$ is the value $f(V) = Sigma_{vin V} f(v)$The Roman domination number, $gamma_R(G)$, of $G$ is theminimum weight of an RDF on $G$.An RDF of minimum weight is called a $gamma_R$-function.A graph G is said to be $g...
متن کاملComputing β-Drawings of 2-Outerplane Graphs
A proximity drawing of a plane graph G is a straight-line drawing of G with the additional geometric constraint that two vertices of G are adjacent if and only if the well-defined “proximity region” of these two vertices does not contain any other vertex. In one class of proximity drawings, known as β-drawings, the proximity region is parameterized by β, where β ∈ [0,∞]. Given a plane graph G, ...
متن کاملApproximation Complexity of Max-Cut on Power Law Graphs
In this paper we study the MAX-CUT problem on power law graphs (PLGs) with power law exponent β. We prove some new approximability results on that problem. In particular we show that there exist polynomial time approximation schemes (PTAS) for MAX-CUT on PLGs for the power law exponent β in the interval (0, 2). For β > 2 we show that for some ε > 0, MAX-CUT is NP-hard to approximate within appr...
متن کامل#BIS-Hardness for 2-Spin Systems on Bipartite Bounded Degree Graphs in the Tree Non-uniqueness Region
Counting independent sets on bipartite graphs (#BIS) is considered a canonical counting problem of intermediate approximation complexity. It is conjectured that #BIS neither has an FPRAS nor is as hard as #Sat to approximate. We study #BIS in the general framework of two-state spin systems in bipartite graphs. Such a system is parameterized by three numbers (β, γ, λ), where β (respectively γ) r...
متن کاملSpatial mixing and approximate counting for Potts model on graphs with bounded average degree
We propose a notion of contraction function for a family of graphs and establish its connection to the strong spatial mixing for spin systems. More specifically, we show that for anti-ferromagnetic Potts model on families of graphs characterized by a specific contraction function, the model exhibits strong spatial mixing, and if further the graphs exhibit certain local sparsity which are very n...
متن کامل